Перевод: с английского на русский

с русского на английский

Bilinear transform

См. также в других словарях:

  • Bilinear transform — The bilinear transform (also known as Tustin s method) is used in digital signal processing and discrete time control theory to transform continuous time system representations to discrete time and vice versa. The bilinear transform is a… …   Wikipedia

  • Bilinear — may refer to* Bilinear sampling, a method in computer graphics for choosing the color of a texture. * Bilinear form * Bilinear interpolation * Bilinear map, a type of mathematical function between vector spaces * Bilinear transform, a method of… …   Wikipedia

  • Bilinear time–frequency distribution — Bilinear time–frequency distributions, or quadratic time–frequency distributions, arise in a sub field field of signal analysis and signal processing called time–frequency signal processing, and, in the statistical analysis of time series data.… …   Wikipedia

  • Z-transform — In mathematics and signal processing, the Z transform converts a discrete time domain signal, which is a sequence of real or complex numbers, into a complex frequency domain representation. It is like a discrete equivalent of the Laplace… …   Wikipedia

  • Matched Z-transform method — The s plane poles and zeros of a 5th order Chebyshev type II lowpass filter to be approximated as a discrete time filter …   Wikipedia

  • Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

  • Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… …   Wikipedia

  • Cayley transform — In mathematics, the Cayley transform, named after Arthur Cayley, has a cluster of related meanings. As originally described by Harvtxt|Cayley|1846, the Cayley transform is a mapping between skew symmetric matrices and special orthogonal matrices …   Wikipedia

  • Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …   Wikipedia

  • Hilbert transform — In mathematics and in signal processing, the Hilbert transform is a linear operator which takes a function, u ( t ), and produces a function, H ( u )( t ), with the same domain. The Hilbert transform is named after David Hilbert, who first… …   Wikipedia

  • Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»